The universal homogeneous binary tree
نویسندگان
چکیده
منابع مشابه
The universal homogeneous binary tree
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable semilinear order which is dense, unbounded, binary branching, and without joins, which we denote by (S2;≤). We study the reducts of (S2;≤), that is, the relational structures with domain S2, all of whos...
متن کاملhomogeneous - universal ’ models
Classes with few models have 'homogeneous-universal' models This paper is concerned with a class K of models and an abstract notion of submodel ≤. Experience in first order model theory has shown the desirability of finding a 'monster model' to serve as a universal domain for K. In the original constructions of Jónsson and Fraissè, K was a universal class and ordinary substructure played the ro...
متن کاملBinary Simple Homogeneous Structures
We describe all binary simple homogeneous structuresM in terms of ∅de nable equivalence relations on M , which coordinatize M and control dividing, and extension properties that respect these equivalence relations.
متن کاملSome Small Deviation Theorems for the Sequence of Binary Random Truncated Functions on a Homogeneous Tree
In this paper, a class of small-deviation theorems for the sequence of random truncated functions on arbitrary random field indexed by the homogeneous tree are established by utilizing asymptotic logarithmic likelihood ratio on the homogeneous tree. As corollaries, some strong limit theorems for the arbitrary random field on the homogeneous tree are obtained.
متن کاملUniversal homogeneous structures ( lecture notes )
We present category-theoretic framework for universal homogeneous structures, with selected applications. Most of the material had been presented as a series of lectures for graduate students at Department of Mathematics, University of Silesia in Katowice, Poland (21 – 23 November 2012).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2018
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exx043